Deterministic finite automaton

Results: 142



#Item
51COMS11700 Pushdown automata Ashley Montanaro Department of Computer Science, University of Bristol

COMS11700 Pushdown automata Ashley Montanaro Department of Computer Science, University of Bristol

Add to Reading List

Source URL: www.cs.bris.ac.uk

Language: English - Date: 2014-05-31 09:18:32
52Regular Sensing Shaull Almagor1 , Denis Kuperberg2 , and Orna Kupferman1 1 2 The Hebrew University, Israel.

Regular Sensing Shaull Almagor1 , Denis Kuperberg2 , and Orna Kupferman1 1 2 The Hebrew University, Israel.

Add to Reading List

Source URL: www.liafa.univ-paris-diderot.fr

Language: English - Date: 2014-10-15 08:28:09
53University of Scranton ACM Student Chapter / Computing Sciences Department 19th Annual High School Programming Contest (2009) -----------------------------------------------------------------------------Problem 1: Fibona

University of Scranton ACM Student Chapter / Computing Sciences Department 19th Annual High School Programming Contest (2009) -----------------------------------------------------------------------------Problem 1: Fibona

Add to Reading List

Source URL: www.cs.uofs.edu

Language: English - Date: 2009-12-01 18:14:21
54INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE[removed]Motif Statistics Pierre NICODE ME, Bruno SALVY, Philippe FLAJOLET

INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE[removed]Motif Statistics Pierre NICODE ME, Bruno SALVY, Philippe FLAJOLET

Add to Reading List

Source URL: algo.inria.fr

Language: English - Date: 1999-05-18 12:04:41
55Turning Automata Theory into a Hands-on Course ∗ Susan H. Rodger Bart Bressler Thomas Finley

Turning Automata Theory into a Hands-on Course ∗ Susan H. Rodger Bart Bressler Thomas Finley

Add to Reading List

Source URL: www.cs.duke.edu

Language: English - Date: 2006-02-24 16:07:36
56Using JFLAP to Interact with Theorems in Automata Theory Eric Gramond and Susan H. Rodger Duke University, Durham, NC [removed] Abstract

Using JFLAP to Interact with Theorems in Automata Theory Eric Gramond and Susan H. Rodger Duke University, Durham, NC [removed] Abstract

Add to Reading List

Source URL: www.cs.duke.edu

Language: English - Date: 1999-01-05 11:27:33
57Integrating Hands-on Work into the Formal Languages Course via Tools and Programming Susan H. Rodger Department of Computer Science Duke University Durham, NC[removed]

Integrating Hands-on Work into the Formal Languages Course via Tools and Programming Susan H. Rodger Department of Computer Science Duke University Durham, NC[removed]

Add to Reading List

Source URL: www.cs.duke.edu

Language: English - Date: 1998-09-22 13:06:06
58On Regular Expression Matching and Deterministic Finite Automata Philip Bille∗ Technical University of Denmark, DTU Compute ABSTRACT

On Regular Expression Matching and Deterministic Finite Automata Philip Bille∗ Technical University of Denmark, DTU Compute ABSTRACT

Add to Reading List

Source URL: tinytocs.org

Language: English - Date: 2015-03-07 12:34:01
59Visualization and Interaction in the Computer Science Formal Languages Course with JFLAP Magdalena Procopiuc1, Octavian Procopiuc and Susan H. Rodger1 Computer Science Department, Box[removed]Duke University Durham, North

Visualization and Interaction in the Computer Science Formal Languages Course with JFLAP Magdalena Procopiuc1, Octavian Procopiuc and Susan H. Rodger1 Computer Science Department, Box[removed]Duke University Durham, North

Add to Reading List

Source URL: www.cs.duke.edu

Language: English - Date: 1998-09-22 13:05:10
60Invariants for equivalence of finite automata Mike Spivey Let S = (S, Σ, δS , s0 , FS ) and T = (T , Σ, δT , t0 , FT ) be two deterministic finite automata with the same alphabet Σ. We say S and T are equivalent if,

Invariants for equivalence of finite automata Mike Spivey Let S = (S, Σ, δS , s0 , FS ) and T = (T , Σ, δT , t0 , FT ) be two deterministic finite automata with the same alphabet Σ. We say S and T are equivalent if,

Add to Reading List

Source URL: spivey.oriel.ox.ac.uk

Language: English - Date: 2010-02-09 12:35:41